Hypergraph rewriting using conformisms
نویسندگان
چکیده
In this paper we study single-pushout transformation in a category of spans, a generalization of the notion of partial morphism in, for instance, 2,4]. As an application, single-pushout transformation in a category of hypergraphs with a special type of partial morphisms, the conformisms, is presented. In particular , we show the existence of the pushout of any pair of conformisms of hypergraphs with the same source hypergraph, and how to construct one such a pushout. Finally, hypergraph rewriting using conformisms is compared to single-pushout hypergraph rewriting by means of a detailed example. We present in this paper an approach to hypergraph rewriting by means of single-pushout transformation in a category of hypergraphs with a special type of partial morphisms, the conformisms, inspired by the homonymous notion in the theory of partial algebras. Although this approach has already been treated by some of us in 1] by means of what we could call \rude-force methods," in this paper we develop it as a special case of single-pushout transformation in a category of spans, a generalization of the notion of partial morphism in, for instance, 2,4]. So, the main result in this note establishes a necessary condition for the existence of the pushout of two such spans. This condition has a part involving properties of the \original" category, from which the category of spans is derived, and a part referring to the speciic spans. Then, we show that such a necessary condition is always satissed in the case of pairs of conformisms of hypergraphs, understood as spans in a category of hypergraphs with \weak" morphisms. This type of arguments using suitable categories of (sort of) partial mor-phisms is well-known, and in particular it was explained to us by M. LL owe (whom we deeply acknowledge with thanks for it). The novelty in our approach lies in part on the fact that our partial morphisms are not equivalence classes as in 2] but single objects, as it is usual to think about them, on the other hand. c 1995 Elsevier Science B. V.
منابع مشابه
A Graph Rewriting Semantics for the Polyadic Calculus
We give a hypergraph rewriting semantics for the polyadic π-calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the π-calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into π-calculus can be shown by using an intermediate notation, so-called name-based graph terms.
متن کاملImplementing -reduction by Hypergraph Rewriting
The aim of this paper is to implement the-reduction in the-calculus with a hypergraph rewriting mechanism called collapsed-tree rewriting. It turns out that collapsed-tree rewriting is sound with respect to-reduction and complete with respect to the Gross-Knuth strategy. As a consequence, there exists a normal form for a collapsed-tree if and only if there exists a normal form for the represent...
متن کاملTowards a Substrate Framework of Computation
A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation. This paper demonstrates how a hypergraph rewriting framework nicely integrates various forms and ingredients of concurrent computation and how simple static analyses help the understanding and optimization of programs. Hypergraph rewriting treats processes...
متن کاملConfluence of Graph Transformation Revisited
It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply...
متن کاملRewriting in Free Hypegraph Categories
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius structures recently appeared in cross-disciplinary applications, including the study of quantum processes, dynamical systems and natural language processing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 2 شماره
صفحات -
تاریخ انتشار 1995